TRB exam online practice test for Computer Science and Engineering dept provides you with ample practice material for TRB exam preparation for cse department which adheres to the real exam format. Each TRB - CSE exam practice test has 10 questions. After completing click on to the COMPLETE TEST to know the score and the correct answers.


Computer Science and Engineering - TRB Online Practice Test - 6

  • Online Practice Test - CSE
   

1.
  The major difference between B tree and B+ tree insertion is how to handle?.
  • A.   Splitting of data
  •  
  • B.   Sorting of data
  •  
  • C.   Merging of data
  •  
  • D.   All the above
  Options: A    B    C    D   
   
 
   

2.
  A full binary tree with 2n + 1nodes contains:.
  • A.   n leaf nodes
  •  
  • B.   n non-leaf nodes
  •  
  • C.   n − 1 leaf nodes
  •  
  • D.   n − 1 non- leaf nodes
  Options: A    B    C    D   
   
   

3.
  PV∼P =.
  • A.   Contradiction
  •  
  • B.   Tautology
  •  
  • C.   Premise
  •  
  • D.   Conclusion
  Options: A    B    C    D   
   
 
   

4.
  6 dice are thrown 729 times. How many times do you expect at least three dice to show 5 or 6?.
  • A.   57
  •  
  • B.   59
  •  
  • C.   56
  •  
  • D.   58
  Options: A    B    C    D   
   
   

5.
  If L be a lattice, then a∧ b=a if and only if:.
  • A.   a∨b=a
  •  
  • B.   a∨b= b
  •  
  • C.   a∨b=0
  •  
  • D.   a∨b=1
  Options: A    B    C    D   
   
 
   

6.
  What is the running time of NFA-to-DFA conversion algorithm?.
  • A.   O(n32n)
  •  
  • B.   O(n34n)
  •  
  • C.   O(n3n)
  •  
  • D.   O(n42n)
  Options: A    B    C    D   
   
   

7.
  Consider a grammar G with n productions, none of then are ∈ productions and G is converted to CNF Then the grammar has: .
  • A.   Exactly O(n2) productions
  •  
  • B.   At least O(n2) productions
  •  
  • C.   Atmost O(n2) productions
  •  
  • D.   Exactly O(n2) productions
  Options: A    B    C    D   
   
 
   

8.
  The time taken by the one tape TM N to simulate ″n″ moves of the K-type TM M is .
  • A.   Ο(nk)
  •  
  • B.   Ο(n2)
  •  
  • C.   Ο(nk)
  •  
  • D.   Ο(kn)
  Options: A    B    C    D   
   
   

9.
  Which of the following is not true?.
  • A.   The language NSA is not recursively enumerable
  •  
  • B.   The language SA is recursive
  •  
  • C.   The language SA is not recursive
  •  
  • D.   The language NSA is not recursive
  Options: A    B    C    D   
   
 
   

10.
  Convert the following binary number to hexadecimal number:0.01111110.
  • A.   0.6F
  •  
  • B.   0.FC
  •  
  • C.   FC
  •  
  • D.   0.7E
  Options: A    B    C    D   
   

Complete Test
tnscholars.com

 

 

 

tnscholars.com.